13/9-approximation for Graphic TSP
نویسنده
چکیده
The Travelling Salesman Problem is one of the most fundamental and most studied problems in approximation algorithms. For more than 30 years, the best algorithm known for general metrics has been Christofides’s algorithm with approximation factor of 2 , even though the socalled Held-Karp LP relaxation of the problem is conjectured to have the integrality gap of only 4 3 . Very recently, significant progress has been made for the important special case of graphic metrics, first by Oveis Gharan et al. [3], and then by Mömke and Svensson [8]. In this paper, we provide an improved analysis of the approach presented in [8] yielding a bound of 13 9 on the approximation factor, as well as a bound of 19 12 + ε for any ε > 0 for a more general Travelling Salesman Path Problem in graphic metrics. 1998 ACM Subject Classification F.2.2 Nonnumerical Algorithms and Problems
منابع مشابه
A 9/7 -Approximation Algorithm for Graphic TSP in Cubic Bipartite Graphs
We prove new results for approximating Graphic TSP. Specifically, we provide a polynomial-time 9 7 -approximation algorithm for cubic bipartite graphs and a ( 9 7 + 1 21(k−2) )-approximation algorithm for k-regular bipartite graphs, both of which are improved approximation factors compared to previous results. Our approach involves finding a cycle cover with relatively few cycles, which we are ...
متن کاملA -approximation algorithm for Graphic TSP in cubic bipartite graphs
We prove new results for approximating Graphic TSP. Specifically, we provide a polynomialtime 9 7 -approximation algorithm for cubic bipartite graphs and a ( 9 7 + 1 21(k−2) )-approximation algorithm for k-regular bipartite graphs, both of which are improved approximation factors compared to previous results. Our approach involves finding a cycle cover with relatively few cycles, which we are a...
متن کاملShorter Tours by Nicer Ears: 7/5-approximation for graphic TSP, 3/2 for the path version, and 4/3 for two-edge-connected subgraphs
We prove new results for approximating the graphic TSP and some related problems. We obtain polynomial-time algorithms with improved approximation guarantees. For the graphic TSP itself, we improve the approximation ratio to 7/5. For a generalization, the connected-T -join problem, we obtain the first nontrivial approximation algorithm, with ratio 3/2. This contains the graphic s-t-path-TSP as ...
متن کاملApproximation hardness of graphic TSP on cubic graphs
We prove explicit approximation hardness results for the Graphic TSP on cubic and subcubic graphs as well as the new inapproximability bounds for the corresponding instances of the (1,2)-TSP. The proof technique uses new modular constructions of simulating gadgets for the restricted cubic and subcubic instances. The modular constructions used in the paper could be also of independent interest.
متن کاملGraphic TSP in 2-connected cubic graphs
We prove that every simple 2-connected cubic n-vertex graph contains a spanning closed walk of length at most 9n/7 − 1, and that such a walk can be found in polynomial time. This yields a polynomial-time 9/7-approximation algorithm for the graphic TSP for 2-connected cubic graphs, which improves the previously known approximation factor of 1.3 for 2-connected cubic graphs. On the negative side,...
متن کامل